Tangent Estimation from Point Samples
نویسندگان
چکیده
Let M be an m-dimensional smooth compact manifold embedded in R, where m is a constant known to us. Suppose that a dense set of points are sampled from M according to a Poisson process with an unknown parameter. Let p be any sample point, let % be the local feature size at p, and let %ε be the distance from p to the (n + 1)th nearest sample point for some n between ( m+1 2 ) + 1 and ( d+1 2 ) . Using the n sample points nearest to p, we can estimate the tangent space at p and it holds with probability 1 − O(n−1/3) that the angular error is O(ε). The running time is bounded by the time to compute the thin SVD of an n× ( d+1 2 ) matrix and the full SVD of an n× d matrix, which is usually O(dn) in practice. We implemented the algorithm and experimentally verified its effectiveness on both noiseless and noisy data. ∗Research supported by the Research Grant Council, Hong Kong, China (project no. 612109). Part of the work was done while Chiu was at HKUST. †Dept. of Computer Science and Engineering, HKUST, Hong Kong. ‡National Institute of Informatics (NII), Tokyo, Japan. §JST, ERATO, Kawarabayashi Large Graph Project.
منابع مشابه
Tangent Space Estimation for Smooth Embeddings of Riemannian Manifolds
Numerous dimensionality reduction problems in data analysis involve the recovery of lowdimensional models or the learning of manifolds underlying sets of data. Many manifold learning methods require the estimation of the tangent space of the manifold at a point from locally available data samples. Local sampling conditions such as (i) the size of the neighborhood (sampling width) and (ii) the n...
متن کاملScale Selection for the Analysis of Point-Sampled Curves: Extended Report
An important task in the analysis and reconstruction of curvilinear structures from unorganized 3-D point samples is the estimation of tangent information at each data point. Its main challenges are in (1) the selection of an appropriate scale of analysis to accommodate noise, density variation and sparsity in the data, and in (2) the formulation of a model and associated objective function tha...
متن کاملOn the normal vector estimation for point cloud data from smooth surfaces
Reliable estimation of the normal vector at a discrete data point in a scanned cloud data set is essential to the correct implementation of modern CAD/CAM technologies when the continuous CAD model representation is not available. A new method based on fitted directional tangent vectors at the data point has been developed to determine its normal vector. A local Voronoi mesh, based on the 3D Vo...
متن کاملLaser Radar based Real-time Ego-motion Estimation for Intelligent Vehicles
Ego-motion estimation is a key issue in intelligent vehicles and important to moving objects tracking. In this paper, after a simple overview of existed method, we present a tangent based hybrid real-time ego-motion estimation algorithm based on laser radar, which is composed of Iterative Tangent weighted Closest Point (ITCP) and Hough transform based Tangent Angle Histogram (HTAH) algorithms t...
متن کاملOn the approximation order of tangent estimators
A classic problem in geometric modelling is curve interpolation to data points. Some of the existing interpolation schemes only require point data, whereas others, require higher order information, such as tangents or curvature values, in the data points. Since measured data usually lack this information, estimation of these quantities becomes necessary. Several tangent estimation methods for p...
متن کاملDoes gaze influence steering around a bend?
M. F. Land and D. N. Lee (1994) suggested that steering around a bend is controlled through the estimation of curvature using the visual direction of a single road feature: the tangent point. The aim of this study was to evaluate, using a simulated environment, whether the high levels of tangent point fixation reported by some researchers are indeed related to steering control. In the first exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 56 شماره
صفحات -
تاریخ انتشار 2016